B vs. Coq to prove a Garbage Collector
نویسنده
چکیده
This paper presents a comparison between two formal methods : the B method and the Coq proof assistant on their usability in an industrial context. Those methods have been used to formalise a garbage collector algorithm and prove its safety property. They are compared on two aspects : formalisation and proof. At each step, the two models are compared in terms of readability, easiness of proof and maintainability. Metrics on both development are presented.
منابع مشابه
Re ecting BDDs in
We describe an implementation and a proof of correctness of binary decision diagrams (BDDs), completely formalized in Coq. This allows us to run BDD-based algorithms inside Coq and paves the way for a smooth integration of symbolic model checking in the Coq proof assistant by using reeection. It also gives us, by Coq's extraction mechanism, certiied BDD algorithms implemented in Caml. We also i...
متن کاملRe ecting BDDs in CoqKumar
We describe an implementation and a proof of correctness of binary decision diagrams (BDDs), completely formalized in Coq. This allows us to run BDD-based algorithms inside Coq and paves the way for a smooth integration of symbolic model checking in the Coq proof assistant by using reeection. It also gives us, by Coq's extraction mechanism, certiied BDD algorithms implemented in Caml. We also i...
متن کاملVerification of a Real-time Garbage Collector in Hoare-style Logic
Many of the current software systems rely on garbage collectors for automatic memory management. This is also the case for various software systems in realtime applications. However, a real-time application often requires an incremental working style of the underlying garbage collection, which renders the garbage collector more complex and less trustworthy. We present a formal verification of t...
متن کاملVerification of an Incremental Garbage Collector in Hoare-Style Logic
Many of the current software systems rely on garbage collectors for automatic memory management. This is also the case for various software systems in real-time applications. However, a real-time application often requires an incremental working style of the underlying garbage collection, which renders the garbage collector more complex and less trustworthy. We present a formal verification of ...
متن کاملVerifying a Concurrent Garbage Collector Using a Rely-Guarantee Methodology
Concurrent garbage collection algorithms are an emblematic challenge in the area of concurrent program verification. In this paper, we address this problem by proposing a mechanized proof methodology based on the popular RelyGuarantee (RG) proof technique. We design a specific compiler intermediate representation (IR) with strong type guarantees, dedicated support for abstract concurrent data s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001